A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Ghrera, S. P.
- A New Group Key Transfer Protocol Using CBU Hash Function
Authors
1 Department of Computer Science and Engineering, Cambridge Institute of Technology, Tatisilwai, Ranchi (Jharkhand), IN
2 Department of Computer Science and Information Technology, Jaypee University of Information Technology, Waknaghat, Distt. Solan, (H.P), IN
Source
Indian Journal of Science and Technology, Vol 7, No 1 (2014), Pagination: 19-24Abstract
In this paper we have proposed and successfully implemented a new group key transfer protocol based on CBU hash function. The proposed scheme relies on mutually trusted Key Distribution Center (KDC) to generate and distribute session keys to all communicating entities secretly. In this scheme the key information is broadcasted at once to all the participating entities, but with the available information only the authorized user will be able to recover the actual session key. The advantage of this protocol lies in the fact that even if the pre-shared master key gets compromised, the attacker will still will not be able to recover the actual session key. Furthermore, our protocol makes use of CBU hash function along with Advanced Encryption Standards (AES) to provide confidentiality.Keywords
Group Key Transfer Protocol, CBU Hash Function, Key Distribution Centre (KDC), Advance Encryption Standards (AES), ConfidentialityReferences
- Blakely GR. Safeguarding cryptographic keys. Proc Am Federation of Information Processing Soc (AFIPS '79). Nat'l Computer Conf. 1979; 48:313–317.
- Berkovits S. How to broadcast a secret. Advances in Cryptology–CRYPTO '91. Lecture Notes in Computer Science. 1991; 547:536–541.
- Stalling W. Cryptography and network security. 4th ed.; 2005.
- Adusumilli P, Zou X, Ramamurthy B. DGKD: Distributed Group Key Distribution with authentication capability. Workshop on Information assurance and Security. IEEE; 2005 Jun.
- Zhang Q, Wang Y. A centralized key management scheme for hierarchical access control. IEEE Communication Society. 2004; 4.
- Harn L, Lin C. Authenticated group key transfer protocol based on secret sharing. IEEE Transactions on Computers. 2010 Jun; 59(6).
- Sherman AT, McGrew DA. Key establishment in large dynamic groups using one-way function trees. IEEE Transactions on Software Engineering. 2003 May; 29(5) : 444–458.
- Song R, Korba L, Yee GOM. A scalable group key manage- ment protocol. IEEE Communication Letters. 2008 July; 12(7).
- Chang C-C , Lin C-H, Chen C-Y. A conference key distribution scheme using interpolating polynomials. IEEE International Conference on Multi-media and Ubiquitous Engineering; 2007; 1(2):963–967.
- Metal M. A new secure multi-cast key distribution protocol using combinatorial boolean approach. Int J Netw Secur. 2009 Jan; 8(1).
- Modified Buyer Seller Watermarking Protocol based on Discrete Wavelet Transform and Principal Component Analysis
Authors
1 1Department of Computer Science, Jaypee University of Information Technoloy (JUIT), Waknaghat - 173234, Solan, Himachal Pradesh, IN
2 Department of Computer Science, Jaypee University of Information Technoloy (JUIT), Waknaghat - 173234, Solan, Himachal Pradesh, IN
3 Department of Computer Science, Jaypee University of Engineering and Technology (JUET), Raghogarh, Guna - 473226. Madhya Pradesh, IN
Source
Indian Journal of Science and Technology, Vol 8, No 35 (2015), Pagination:Abstract
This digital watermarking protocol is basically applied to preserve the rights for both parties involving in E-commerce i.e. buyer and seller. Principal component analysis is used to reduce the correlation coefficient. This protocol uses wavelet transform with principal component analysis and integrates digital watermarking techniques and public key cryptosystem for proving the ownership of digital content. In this paper a watermark image that i.e. baby image is inserted into selected high frequency sub-bands of discrete wavelet transformed. Then we have applied the principal component analysis transformation for selecting the blocks. The process for selecting the blocks are depends by calculating the energy of every block and then the maximum energy blocks were selected. We have calculated parameters such as PSNR and NCC for checking the imperceptibility and robustness of the proposed approach.Keywords
Copyright Protection, Cryptography, Multimedia, Principal Component Analysis- A Novel Approach to Outlier Detection using Modified Grey Wolf Optimization and k-Nearest Neighbors Algorithm
Authors
1 Department of CSE, Ajay Kumar Garg Engineering College, Ghaziabad - 201009, Uttar Pradesh, IN
2 Department of CSE and IT, Jaypee University of Information Technology, Waknaghat -173234, Himachal Pradesh, IN
3 Department of CSE and IT, Jaypee Institute of Information Technology, Noida - 201301, Uttar Pradesh, IN
Source
Indian Journal of Science and Technology, Vol 9, No 44 (2016), Pagination:Abstract
Objectives: Detecting dataset anomalies has been an interesting yet challenging area in this front. This work proposes a hybrid model using meta-heuristics to detect dataset anomalies efficiently. Methods/Statistical Analysis: A distance based modified grey wolf optimization algorithm is designed which uses the k- Nearest Neighbor algorithm for better results. The proposed approach works well with supervised datasets and gives anomalies with respect to each attribute of the dataset based on a threshold using a confidence interval. Findings: The proposed approach works well with regression as well as classification datasets in the supervised scenario. The results in terms of number of anomalies and the accuracy using confusion matrix are depicted and have been evaluated for a classification dataset considering a minority class to be anomalous in comparison to the majority class. The results have been evaluated based on varying the threshold and ‘k’ values and depending on the data set domain and data distribution the optimal parameters can be identified and used. Application/Improvements: The proposed approach can be used for anomaly detection of datasets of different domains of supervised scenario. It can also be extended to unsupervised scenario by integrating it with K-means clustering.Keywords
Data Mining, Grey Wolf Optimization, k-Nearest Neighbor, Machine Learning, Outlier Detection.- Biometrics Recognition:An Overview
Authors
1 Jaypee University of Information Technology, Waknaghat, Solan, Himachal Pradesh, IN
2 Apollo Institute of Technology, Kanpur, UP, IN
Source
Indian Science Cruiser, Vol 24, No 5 (2010), Pagination: 26-31Abstract
Biometrics is becoming an essential component of effective person identification solutions because biometric identifiers cannot be shared or misplaced, and they intrinsically represent the individual's bodily identity. Recognition of a person by their body, then linking that body to an externally established “identity”, forms a very powerful tool of identity management with tremendous potential consequences, both positive and negative. Consequently, biometrics is not only a fascinating pattern recognition research problem but, if carefully used, is an enabling technology with the potential to make our society safer, reduce fraud and provide user convenience. In this paper, a brief overview of biometric system. Comparison of Biometric Technologies and different application of the systems is given.